A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem

Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a selfstabilizing heuristic solution to the problem. Our algorithm is constructed by four layered modules (sub-algorithms): construction of a shortest path forest, transformation of the network, construction of a minimum spanning tree, and pruning unnecessary links and processes. Competitiveness is 2(1 − 1/l), where l is the number of leaves of optimal solution. key words: distributed algorithm, fault-tolerant, self-stabilizing algorithm, fair composition, Steiner tree problem